|
In mathematics, a strong prime is a prime number with certain special properties. The definitions of strong primes are different in cryptography and number theory. == Definition in cryptography == In cryptography, a prime number is ''strong'' if the following conditions are satisfied.〔Ron Rivest and Robert Silverman, ''Are 'Strong' Primes Needed for RSA?'', Cryptology ePrint Archive: Report 2001/007. http://eprint.iacr.org/2001/007〕 * is sufficiently large to be useful in cryptography; typically this requires to be too large for plausible computational resources to enable a cryptanalyst to factorise products of multiplied by other strong primes. * has large prime factors. That is, for some integer and large prime . * has large prime factors. That is, for some integer and large prime . * has large prime factors. That is, for some integer and large prime 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Strong prime」の詳細全文を読む スポンサード リンク
|